On an extremum problem concerning trigonometrical polynomials
نویسندگان
چکیده
منابع مشابه
An extremum problem for polynomials
© Foundation Compositio Mathematica, 1959-1960, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fic...
متن کاملAn Extremu M Problem concerning Algebraic Polynomials
Let S " he the set of all polynomials whose degree does not exceed n and whose all zeros are real but lie outside (-1, 1). Similarly, we say p"E Q " if p,(x) is a real polynomial whose all zeros lie outside the open disk with center at the origin and radius l. Further we will denote by H " the set of all polynomials of degree-n and of the form k=O where q,,k (x) = (1 +x)k (l-x)"-'. Elements of ...
متن کاملOn a Problem concerning Permutation Polynomials
Let S(f) denote the set of integral ideals / such that / is a permutation polynomial modulo i", where / is a polynomial over the ring of integers of an algebraic number field. We obtain a classification for the sets S which may be written in the form S(f). Introduction. A polynomial f(x) with coefficients in a commutative ring R is said to be a permutation polynomial modulo an ideal I oi R (abb...
متن کاملOn a problem of Byrnes concerning polynomials with restricted coefficients
We consider a question of Byrnes concerning the minimal degree n of a polynomial with all coefficients in {−1, 1} which has a zero of a given order m at x = 1. For m ≤ 5, we prove his conjecture that the monic polynomial of this type of minimal degree is given by ∏m−1 k=0 (x 2 − 1), but we disprove this for m ≥ 6. We prove that a polynomial of this type must have n ≥ e √ m(1+o(1)), which is in ...
متن کاملOn an Extremal Problem concerning Primitive Sequences
A sequence a,< . . . of integers is called primitive if no a divides any other . (a 1 < . . . will always denote a primitive sequence .) It is easy to see that if a i < . . . < a,,, < n then max k = [(n + 1) /2] . The following question seems to be very much more difficult . Put f(n) =niax E 1) , a,, where the maximum is taken over all primitive sequences all of wliose terms are not exceeding n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 1951
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm-12-1-166-169